GFS-Btree: A Scalable Peer-to-Peer Overlay Network for Lookup Service

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. We propose a new scalable Peer-to-Peer overlay network, GFS-Btree, which is resembling a Btree network. By adding additional linkages to Btree, GFS-Btree can relieve the congestion at the root and the other branch nodes. The events of a node joining and leaving the GFS-Btree system require no global coordination and require maximally O(logn) nodes to change their state. Lookup routing is achievable on GFS-Btree network in O(logn) hops with O(1) connection cost.